A modified SQP algorithm for minimax problems
نویسندگان
چکیده
منابع مشابه
A Simple SQP Algorithm for Constrained Finite Minimax Problems
A simple sequential quadratic programming method is proposed to solve the constrained minimax problem. At each iteration, through introducing an auxiliary variable, the descent direction is given by solving only one quadratic programming. By solving a corresponding quadratic programming, a high-order revised direction is obtained, which can avoid the Maratos effect. Furthermore, under some mild...
متن کاملAn SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
A common strategy for achieving global convergence in the solution of semi-innnite programming (SIP) problems, and in particular of continuous minimax problems, is to (approximately) solve a sequence of discretized problems, with a progressively ner discretization meshes. Finely discretized minimax and SIP problems, as well as other problems with many more objec-tives/constraints than variables...
متن کاملErratum: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
An error is pointed out in the local convergence proof in the quoted paper SIAM A correct proof is given. The proof of Lemma 3.14 in 2] is incorrect. Namely, proving the claim in the second sentence of the proof does not \complete the proof" as stated. To see this, note that the mathematical induction argument hinted at in that sentence merely proves that, for the innnite index set K whose exis...
متن کاملA Genetic Algorithm for Minimax Optimization Problems
Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...
متن کاملA Truncated Sqp Algorithm for Large Scale Nonlinear Programming Problems
We consider the inequality constrained nonlinear programming problem and an SQP algorithm for its solution. We are primarily concerned with two aspects of the general procedure, namely, the approximate solution of the quadratic program, and the need for an appropriate merit function. We rst describe an (iterative) interior-point method for the quadratic programming subproblem that, no matter wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2009
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2009.06.009